Optimal tetrahedralization of the 3D-region “between” a convex polyhedron and a convex polygon
نویسندگان
چکیده
منابع مشابه
Optimal Tetrahedralization of the 3d-Region between a Convex Polyhedron and a Convex Polygon
Given a convex polyhedron P and a convex polygon Q in ~3 such that Q's supporting plane does not intersect P, we are interested in tetrahedralizing the closure of the difference conve:c_hull(P U Q ) \ P; since P is convex, this difference is a connected nonconvex subset of T~ 3 which we call the region "between" P and Q. The problem is motivated by the work of Bern on tetrahedralizing the regio...
متن کاملA Genetic Algorithm for the Minimum Tetrahedralization of a Convex Polyhedron
A minimum tetrahedralization of a convex polyhedron is a partition of the convex polyhedron with minimum number of tetrahedra. The problem of finding the minimum tetrahedralization of a convex polyhedron is known to be NP-Hard. In this paper, a genetic algorithm is presented to find an approximate solution to this problem. Our result always shows improvements to those produced by commonly used ...
متن کاملthe investigation of the relationship between type a and type b personalities and quality of translation
چکیده ندارد.
Algorithms for optimal area triangulations of a convex polygon
Given a convex polygon with n vertices in the plane, we are interested in triangulations of its interior, i.e., maximal sets of nonintersecting diagonals that subdivide the interior of the polygon into triangles. The MaxMin area triangulation is the triangulation of the polygon that maximizes the area of the smallest triangle in the triangulation. Similarly, the MinMax area triangulation is the...
متن کاملCircumscribed sphere of a convex polyhedron
Suppose that K is a convex polyhedron in the n-dimensional Euclidean space R. Suppose that the extreme points of K are P1, P2, . . . , Pm ( m ≥ n + 1). If P is an arbitrary interior point of K, then there exist vertices Pi1 , Pi2 , . . . , Pin+1 of K and a point Q of R n and a positive number r > 0 for which ||Pik − Q|| = r for 1 ≤ k ≤ n + 1 , ||Pj − Q|| ≤ r for 1 ≤ j ≤ m and P is an interior p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1996
ISSN: 0925-7721
DOI: 10.1016/0925-7721(95)00011-9